Some Conjectures and Open Problems on Partition Hook Lengths

نویسنده

  • Guo-Niu Han
چکیده

Abstract. We present some conjectures and open problems on partition hook lengths, which are all motivated by known results on the subject. The conjectures are suggested by extensive experimental calculations using a computer algebra system. The first conjecture unifies two classical results on the number of standard Young tableaux and the number of pairs of standard Young tableaux of the same shape. The second unifies the classical hook formula and the marked hook formula. The third includes the long standing Lehmer conjecture which says that the Ramanujan tau-function never takes the zero value. The fourth is a more precise version of the third one in the case of 3-cores. We also list some open problems on partition hook lengths.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Author manuscript, published in "The Ramanujan Journal (2009) 9 pages" Hook lengths and shifted parts of partitions

— Some conjectures on partition hook lengths, recently stated by the author, have been proved and generalized by Stanley, who also needed a formula by Andrews, Goulden and Jackson on symmetric functions to complete his derivation. Another identity on symmetric functions can be used instead. The purpose of this note is to prove it.

متن کامل

Results and conjectures on simultaneous core partitions

An n-core partition is an integer partition whose Young diagram contains no hook lengths equal to n. We consider partitions that are simultaneously a-core and b-core for two relatively prime integers a and b, which correspond to abacus diagrams and the combinatorics of the affine symmetric group (type A). We observe that self-conjugate simultaneous core partitions correspond to type C combinato...

متن کامل

Theorems, Problems and Conjectures

These notes are designed to offer some (perhaps new) codicils to related work, a list of problems and conjectures seeking (preferably) combinatorial proofs. The main items are Eulerian polynomials and hook/contents of Young diagram, mostly on the latter. Formulas analogues to or in the spirit of works by Han, Nekrasov-Okounkov and Stanley are distributed throughout. Concluding remarks are provi...

متن کامل

Generalized Hook Lengths in Symbols and Partitions

In this paper we present, for any integer d, a description of the set of hooks in a d-symbol. We then introduce generalized hook length functions for a d-symbol, and prove a general result about them, involving the core and quotient of the symbol. We list some applications, for example to the well-known hook lengths in integer partitions. This leads in particular to a generalization of a relati...

متن کامل

Discovering Hook Length Formulas by an Expansion Technique

— We introduce a hook length expansion technique and explain how to discover old and new hook length formulas for partitions and plane trees. The new hook length formulas for trees obtained by our method can be proved rather easily, whereas those for partitions are much more difficult and some of them still remain open conjectures. We also develop a Maple package HookExp for computing the hook ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Experimental Mathematics

دوره 18  شماره 

صفحات  -

تاریخ انتشار 2009